Information Freshness in Cache Updating Systems

نویسندگان

چکیده

We consider a cache updating system with source, and user. There are $n$ files. The source keeps the freshest version of files which updated known rates $\lambda _{i}$ . downloads from $c_{i}$ user gets updates $u_{i}$ When an update, it either fresh update or file at becomes outdated by in case update. find analytical expression for average freshness Next, we generalize our setting to where there multiple caches between user, provide alternating maximization based method cache(s), , maximize observe that given set (resp. cache), optimal rate allocation policy user) is threshold rapidly changing may be equal zero. Finally, users connected single total over all users.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Easy Freshness with Pequod Cache Joins

Pequod is a distributed application-level key-value cache that supports declaratively defined, incrementally maintained, dynamic, partially-materialized views. These views, which we call cache joins, can simplify application development by shifting the burden of view maintenance onto the cache. Cache joins define relationships among key ranges; using cache joins, Pequod calculates views on dema...

متن کامل

WWW Cache Updating: An Active Networking Approach

In this paper, we present a new method to improve cache updating in active networks. In e-commerce applications and financial market services, information contained in the objects delivered by the server to the clients can rapidly change with time. Therefore, the challenge is not only to locate a cache that contains the required object but also to select the most current version of the object o...

متن کامل

Trading Freshness for Performance in Distributed Systems

Many data management systems are faced with a constant, high-throughput stream of updates. In some cases, these updates are generated externally: a data warehouse system must ingest a stream of external events and update its state. In other cases, they are generated by the application itself: large-scale machine learning frameworks maintain a global shared state, which is used to store the para...

متن کامل

Minimum Information Updating with Specified Marginals in Probabilistic Expert Systems

A probability-updating method in probabilistic expert systems is considered in this paper based on the minimum discrimination information. Here, newly acquired information is taken as the latest true marginal probabilities, not as newly observed data with the same weight as previous data. Posterior probabilities are obtained by updating prior probabilities subject to the latest true marginals. ...

متن کامل

Updating Atomic Information in Labelled Database Systems ( Extended Abstract )

This paper investigates the applications of Labelled Deductive Systems (LDS) as a framework for the development of a computational formalism for the description of active historical databases. This formalism is then applied to the study of retroactive updates. The propositional temporal logic USV/'Z for temporal validity is presented and we prove its soundness and completeness. The historical d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Wireless Communications

سال: 2021

ISSN: ['1536-1276', '1558-2248']

DOI: https://doi.org/10.1109/twc.2020.3037144